//容量为m的小根堆 比堆顶大就压入
#include <cstdio>
using namespace std;
#define DEBUG
const int N=1010;
int n;
int main()
{
    #ifdef DEBUG
        freopen("./in.txt", "r", stdin);
        freopen("./out.txt", "w", stdout);
    #endif
    scanf("%d%d", &n);
    for(int i=0; i<=n>>1; i++)
        printf("%d=%d+%d\n", n, i, n-i);
    return 0;
}